Calculi for Intuitionistic Normal Modal Logic
نویسنده
چکیده
This paper provides a call-by-name and a call-by-value term calculus, both of which have a Curry-Howard correspondence to the box fragment of the intuitionistic modal logic IK. The strong normalizability and the confluency of the calculi are shown. Moreover, we define a CPS transformation from the call-by-value calculus to the call-by-name calculus, and show its soundness and completeness.
منابع مشابه
A uniform tableau method for intuitionistic modal logics I
We present tableau systems and sequent calculi for the intuitionistic analogues and IS5 of the normal classical modal logics. We provide soundness and completeness theorems with respect to the models of intuitionistic logic enriched by a modal accessibility relation, as proposed by G. We also investigate the relationship of these logics with some other intuitionistic modal logics proposed in th...
متن کاملProof search issues in some non-classical logics
This thesis develops techniques and ideas on proof search. Proof search is used with one of two meanings. Proof search can be thought of either as the search for a yes/no answer to a query (theorem proving), or as the search for all proofs of a formula (proof enumeration). This thesis is an investigation into issues in proof search in both these senses for some non-classical logics. Gentzen sys...
متن کاملCall-by-Name and Call-by-Value in Normal Modal Logic
This paper provides a call-by-name and a call-by-value calculus, both of which have a Curry-Howard correspondence to the minimal normal logic K. The calculi are extensions of the λμ-calculi, and their semantics are given by CPS transformations into a calculus corresponding to the intuitionistic fragment of K. The duality between call-by-name and call-by-value with modalities is investigated in ...
متن کاملUniform interpolation and the existence of sequent calculi
General conditions on sequent calculi are formulated under which the intermediate and modal logics corresponding to the calculi have uniform interpolation. It follows that the intuitionistic versions of K and KD, as well as several other intuitionistic modal logics, have uniform interpolation. It also follows that no intermediate or intuitionistic modal logic without uniform interpolation has a...
متن کاملProof Theory and Proof Search of Bi-Intuitionistic and Tense Logic
In this thesis, we consider bi-intuitionistic logic and tense logic, as well as the combined bi-intuitionistic tense logic. Each of these logics contains a pair of dual connectives, for example, Rauszer’s bi-intuitionistic logic [100] contains intuitionistic implication and dual intuitionistic exclusion. The interaction between these dual connectives makes it non-trivial to develop a cut-free s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1606.03180 شماره
صفحات -
تاریخ انتشار 2007